A local limit theorem for the critical random graph
نویسندگان
چکیده
منابع مشابه
A Local Limit Theorem for the Critical Random Graph
We consider the limit distribution of the orders of the k largest components in the Erdős-Rényi random graph inside the “critical window” for arbitrary k. We prove a local limit theorem for this joint distribution and derive an exact expression for the joint probability density function.
متن کاملThe Local Limit Theorem: A Historical Perspective
The local limit theorem describes how the density of a sum of random variables follows the normal curve. However the local limit theorem is often seen as a curiosity of no particular importance when compared with the central limit theorem. Nevertheless the local limit theorem came first and is in fact associated with the foundation of probability theory by Blaise Pascal and Pierre de Fer...
متن کاملThe Local Central Limit Theorem for a Gibbs Random Field
We extend the validity of the implication of a local limit theorem from an integral one. Our extension eliminates the finite range assumption present in the previous works by using the cluster expansion to analyze the contribution from the tail of the potential. 1. Definitions and Results 1.1. Assumptions We consider a v-dimensional lattice spin system, to each χeZ is associated a spin sx that ...
متن کاملA local central limit theorem for triangles in a random graph
In this paper, we prove a local limit theorem for the distribution of the number of triangles in the Erdos-Renyi random graph G(n, p), where p ∈ (0, 1) is a fixed constant. Our proof is based on bounding the characteristic function ψ(t) of the number of triangles, and uses several different conditioning arguments for handling different ranges of t.
متن کاملA local limit theorem for perturbed random walks
The main result reported here is a Stone type local limit theorem for perturbed random walks 2, = S, + 5, when some slow variation conditions are imposed on 5,‘s.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2009
ISSN: 1083-589X
DOI: 10.1214/ecp.v14-1451